DNA Self-assembly Model for Matrix Addition Problem
نویسندگان
چکیده
The technology of DNA self-assembly has played an important role in the field of DNA computing and nanotechnology. Many small-scaled NP complete problems can be solved by self-assembly model. In this paper, we based on the addition of two numbers, and proposed the addition of two matrices of DNA Tile self-assembly model. The algorithm can be applied to add two elements in the corresponding positions automatically, and then in top line of the assembly appears the final results. Theoretical analysis shows that the model can solve the matrix addition operation of any order.
منابع مشابه
Diamondoids and DNA Nanotechnologies
Diamondoids are cage-like saturated hydrocarbons consisting of fused cyclohexane rings. The Diamondoids family of compounds is one of the best candidates for molecular building blocks (MBBs) in nanotechnology to construct organic nanostructures compared to other MBBs known so far. The challenge is to find a route for self-assembly of these cage hydrocarbons and their applications in the bottom-...
متن کامل3D DNA self-assembly for maximum weighted independent set problem
The problem of finding a maximum weighted independent set (MWIS) is a classical combinatorial optimization problem of graph theory, which has been proved to be NP-complete (NPC). A 2-D DNA tile self-assembly model for solving the problem has been proposed previously, but it still has many deficiencies. In this paper, we will propose a 3-D DNA tile self-assembly model based on 2D DNA tile self-a...
متن کاملA Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers
This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...
متن کاملAn algorithm for integrated worker assignment, mixed-model two-sided assembly line balancing and bottleneck analysis
This paper addresses a multi-objective mixed-model two-sided assembly line balancing and worker assignment with bottleneck analysis when the task times are dependent on the worker’s skill. This problem is known as NP-hard class, thus, a hybrid cyclic-hierarchical algorithm is presented for solving it. The algorithm is based on Particle Swarm Optimization (PSO) and Theory of Constraints (TOC) an...
متن کاملAn Analytical Approach for Single and Mixed-Model Assembly Line Rebalancing and Worker Assignment Problem
In this paper, an analytical approach is used for assembly line rebalancing and worker assignment for single and mixed-model assembly lines based on a heuristic-simulation algorithm. This approach helps to managers to select a better marketing strategy when different combinations of demands are suitable.Furthermore, they can use it as a guideline to know which worker assignment is better for ea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JCP
دوره 6 شماره
صفحات -
تاریخ انتشار 2011